The Ehrenfeucht-fra¨ıssé-game of Length Ω 1
نویسندگان
چکیده
Let A and B be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fräıssé-game of length ω1 of A and B which we denote by Gω1(A,B). This game is like the ordinary Ehrenfeucht-Fräıssé-game of Lωω except that there are ω1 moves. It is clear that Gω1(A,B) is determined if A and B are of cardinality ≤ א1. We prove the following results:
منابع مشابه
Two-Variable Ehrenfeucht-Fraisse Games over Omega-Terms
Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to use infinite Ehrenfeucht-Fra¨ıssé games on linear orders for showing that some given fragment satisfies an identity of omega-terms (STACS 2014). After revisi...
متن کاملOn Winning Strategies in Ehrenfeucht-Fraïssé Games
We present a powerful and versatile new suucient condition for the second player (the \duplicator") to have a winning strategy in an Ehrenfeucht-Fra ss e game on graphs. We accomplish two things with this technique. First, we give a simpler and much easier-to-understand proof of Ajtai and Fagin's result that reachability in directed nite graphs is not in monadic NP. (Monadic NP, otherwise known...
متن کاملLogical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates
Given a rst{order formula ' with predicate symbols e 1 such a solution is deened to be jS 0 j. In a strong sense, every polynomially bounded NP{optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s 1 ; : : : ; s r are restricted to be monadic. The result is proved by an Ehrenfeucht{Fra ss e game and remains true in several more...
متن کاملKolmogorov complexity and symmetric relational structures
We study partitions of Fra¨ıssé limits of classes of finite relational structures where the partitions are encoded by infinite binary strings which are random in the sense of Kolmogorov-Chaitin.
متن کاملA Partial Characterization of Ehrenfeucht-Fräıssé Games on Fields and Vector Spaces
In this paper we examine Ehrenfeucht-Fräıssé (EF) games on fields and vector spaces. We find the exact length of the EF game on two algebraically closed fields of finite transcendence degree over Q or Z/pZ. We also determine an upper bound on the length of any EF game on models (F1 ,F1) and (F m 2 ,F2 of vector spaces where m = n and a lower bound for the special case F1 = F2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993